Tutorial to Locales and Locale Interpretation∗ Clemens Ballarin Abstract Locales are Isabelle’s approach for dealing with parametric theories. They have been designed as a module system for a theorem prover

Source URL: isabelle.in.tum.de

• Structure
• Lattice theory
• Algebraic structures
• Distributive lattice
• Complete Heyting algebra
• Duality
• Join and meet
• Lattice
• Partially ordered set
• Order theory
• Mathematics
• Abstract algebra

Poset models of topological spaces Dongsheng Zhao Abstract. We consider poset models of topological spaces and show that every T1 -space has an bounded complete algebraic poset model, thus give a positive answer to a que

Source URL: math.nie.edu.sg

• Topology
• Complete partial order
• Filter
• Partially ordered set
• Domain theory
• Ideal
• Uniform space
• Metric space
• Lattice
• Order theory
• Mathematics
• Structure

Posets for Congurations! Arend Rensink University of Twente P.O.Box 217, 7500 AE Enschede, the Netherlands email: [removed]

Source URL: doc.utwente.nl

• Abstraction
• Partially ordered set
• Pointwise
• Ideal
• Compact element
• Lattice
• Equivalence relation
• Dual
• Category
• Order theory
• Mathematics
• Structure

QUEUE PROBLEMS REVISITED1 Richard P. Stanley A queue problem is a chess problem in which each solution has the same set of moves, but the order of the moves can vary. The object is to count the number of solutions. The c

Source URL: www-math.mit.edu

• Structure
• Abstraction
• Order theory
• Mathematics
• Partially ordered set

doi:[removed]j.jet[removed]

Source URL: folk.uio.no

• Mathematical analysis
• Order theory
• Voting systems
• Voting theory
• Voting system criteria
• Social Choice and Individual Values
• Pareto efficiency
• Partially ordered set
• Constructible universe
• Mathematics
• Social choice theory
• Structure

1993 Paper 11 Question 11 Discrete Mathematics Let A be a non-empty set, and ≺ be a relation on A. What is meant by saying that (A, ≺) is a partially ordered set? [3 marks]

Source URL: www.cl.cam.ac.uk

• Abstraction
• Partially ordered set
• Total order
• Ordered set
• Binary relation
• Finitary relation
• Transitive closure
• Well-order
• Constructible universe
• Mathematics
• Order theory
• Structure

2001 Paper 1 Question 8 Discrete Mathematics Let (A, 6A ) and (B, 6B ) be partially ordered sets. (a) Define the product order on A×B and prove that it is a partial order. [4 marks]

Source URL: www.cl.cam.ac.uk

• Abstraction
• Lattice
• Supremum
• Partially ordered set
• Upper and lower bounds
• Infimum
• Ordinal optimization
• Least-upper-bound property
• Order theory
• Mathematics
• Structure

1997 Paper 1 Question 7 Discrete Mathematics Let us say that a finite partial order (A, v) is tree-like if, for every a ∈ A, the set (of its predecessors) {x ∈ A | x v a ∧ x 6= a} either is empty or has a unique m

Source URL: www.cl.cam.ac.uk

• Binary relation
• Hasse diagram
• Presentation of a group
• Differential equation
• Function
• Szpilrajn extension theorem
• Ancestral relation
• Mathematics
• Order theory
• Partially ordered set

1996 Paper 1 Question 7 Discrete Mathematics State the requirements for (S, 6) to be a partially-ordered set. Define the notion of a topological sort of S. [10 marks]

Source URL: www.cl.cam.ac.uk

On Bayesian Networks and Partial Orders Pekka Parviainen University of Helsinki [removed]

Source URL: www.select.cs.cmu.edu

• Statistical theory
• Networks
• Bayesian network
• Directed acyclic graph
• Bayesian inference
• Partially ordered set
• Machine learning
• Statistics
• Bayesian statistics
• Graphical models